Franco P . Preparata N ° 3747
نویسندگان
چکیده
The minimum zone cylinder of a set of points in three dimensions is the cylindric crown deened by a pair of coaxial cylinders with minimal radial separation (width). In the context of tolerancing metrology, the set of points is nominally cylindrical, i.e., the points are known to lie in close proximity of a known reference cylinder. Using approximations which are valid only in the neighborhood of the reference cylinder, we can get a very good approximation of the minimum zone cylinder. The process provides successive approximations, and each iteration involves the solution of a linear programming problem in six dimensions. The error between the approximation and the optimal solution converges very rapidly (typically in three iterations in practice) down to a limit error of 8! 2 0 R (where ! 0 is the width and R is the external radius of the zone cylinder). valuation de la cylindricitt d'un ensemble de point prrs d'un cylindre nominal RRsumm : La zone cylindrique minimale d'un ensemble de points en trois dimensions est la couronne cylindrique dddnie par deux cylindres coaxiaux telle que la diiirence des rayons ((paisseur) soit minimale. Pour une application en mmtrologie, l'ensemble de points est nominalement cylindrique, c'est-dire que les points sont proches d'un cylindre de rrffrence connu. En utilisant des approximations valides au voisinage de ce cylindre de rrffrence, on obtiens une trrs bonne approximation de la zone cylindrique minimale. La mmthode fournie des approximations successives ; chaque ittration rrsout un probllme de programmation linnaire en dimension six. L'erreur entre l'approximation et la solution optimale converge trrs rapidement (trois ittrations en pratique) vers une erreur limite de 8! 2 0 R (! 0 est l''paisseur minimale et R le rayon du cylindre de rrffrence).
منابع مشابه
Computing the union of 3-colored triangles
Given is a set S of n points, each colored with one of k ≥ 3 colours. We say that a triangle defined by three points of S is 3-colored if its vertices have distinct colours. We prove in this paper that the problem of constructing the boundary of the union T (S) of all such 3-colored triangles can be done in optimal O(n log n) time.
متن کاملThe Densest Hemisphere Problem
DD i j a n M73 1473 E D I T I O N O F 1 N O V 65 I S O B S O L E T E __________________U N C L A S S I F I E D _______________________ _ S E C U R I T Y C L A S S I F I C A T I O N O F T H I S P A G E (When Data Entered) SECURITY CLASSIFICATION OP THIS PAPE (When D a ta Entered) «
متن کاملFully Dynamic Point Location in a Monotone Subdivision
In this paper a dynamic technique for locating a point in a monotone planar subdivision, whose current number of vertices is n, is presented. The (complete set of) update operations are insertion of a point on an edge and of a chain of edges between two vertices, and their reverse operations. The data structure uses space O(n). The query time is O(log n), the time for insertion/deletion of a po...
متن کامل